Explicit construction of graphs with an arbitrary large girth and of large size

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size

Let k ≥ 3 be a positive odd integer and q be a power of a prime. In this paper we give an explicit construction of a q–regular bipartite graph on v = 2q vertices with girth g ≥ k + 5. The constructed graph is the incidence graph of a flag–transitive semiplane. For any positive integer t we also give an example of a q = 2–regular bipartite graph on v = 2q vertices with girth g ≥ k + 5 which is b...

متن کامل

Cycles in graphs of fixed girth with large size

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

متن کامل

Large-Girth Roots of Graphs

We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + 3, thus improving a bound conjectured by Farzad et al. (STACS 2009). Our algorithm also finds all r-th roots of a given graph that have girth at least 2r+3 and no degree one vertices, which is a step towards a recent ...

متن کامل

Extraconnectivity of graphs with large girth

Following Harary, the conditional connectivity (edge-connectivity) of a graph with respect to a given graph-theoretic property is the minimum cardinality of a set of vertices (edges), if any, whose deletion disconnects the graph and every remaining component has such a property. We study the case in which all these components are different from a tree whose order is not greater than n. For inst...

متن کامل

Graphs With Large Girth And Large Chromatic Number

In the first part of these notes we use a probabilistic method to show the existence of graphs with large girth and large chromatic number. In the second part we give an explicit example of such graphs. It is mostly based on the third chapter of Some Applications Of Modular Forms by Peter Sarnak and also the third and forth chapters of Elementary Number Theory, Group Theory, And Ramanujan Graph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1995

ISSN: 0166-218X

DOI: 10.1016/0166-218x(94)00058-l